Semi Greedy Algorithm for Finding Connectivity in Microchip Physical Layouts

نویسنده

  • Clemente Izurieta
چکیده

Scan based or Line Sweep methods are a traditional mechanism to traverse the physical layout, or artwork of a microchip. These traversals are incremental in nature. They typically traverse the artwork from bottom to top (in the y direction) and from left to right (in the x direction) in a traditional Cartesian plane. As the traversal occurs, client applications need to know what causes a given event. For example, an analysis algorithm may be interested in finding out every time two rectangle shapes overlap or touch. This is important because such an overlap could represent a short in a circuit. The number of rectangles used to represent real world designs of artwork in a microchip is in the order of one million per metal layer, thus various optimization techniques are necessary to breakdown the complexity of such designs. This paper describes a semi-greedy technique coupled with an object oriented design pattern to aid in traversing and reporting events of chip data.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Haplotype Block Partitioning and tagSNP Selection under the Perfect Phylogeny Model

Single Nucleotide Polymorphisms (SNPs) are the most usual form of polymorphism in human genome.Analyses of genetic variations have revealed that individual genomes share common SNP-haplotypes. Theparticular pattern of these common variations forms a block-like structure on human genome. In this work,we develop a new method based on the Perfect Phylogeny Model to identify haplo...

متن کامل

Geometric properties of graph layouts optimized for greedy navigation

The graph layouts used for complex network studies have been mainly developed to improve visualization. If we interpret the layouts in metric spaces such as Euclidean ones, however, the embedded spatial information can be a valuable cue for various purposes. In this work, we focus on encoding useful navigational information to geometric coordinates of vertices of spatial graphs, which is a reve...

متن کامل

Greedy Connectivity of Geographically Embedded Graphs

We introduce a measure of greedy connectivity for geographical networks (graphs embedded in space) and where the search for connecting paths relies only on local information, such as a node's location and that of its neighbors. Constraints of this type are common in everyday life applications. Greedy connectivity accounts also for imperfect transmission across established links and is larger th...

متن کامل

An Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria

In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...

متن کامل

An Iterated Greedy Algorithm for Flexible Flow Lines with Sequence Dependent Setup Times to Minimize Total Weighted Completion Time

This paper explores the flexile flow lines where setup times are sequence- dependent. The optimization criterion is the minimization of total weighted completion time. We propose an iterated greedy algorithm (IGA) to tackle the problem. An experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of IGA are compared against those of some other exist...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003